The rkd-Tree: An Improved kd-Tree for Fast n-Closest Point Queries in Large Point Sets
نویسنده
چکیده
The kd-tree is used in various applications, such as photon simulation with photon maps, or normal estimation in point sets for reconstruction, in order to perform fast n-closest neighbour searches in huge, static data sets of point sets of arbitrary dimensions. In a number of cases, where lower dimensional point sets are embedded in higher dimensional spaces, it has been shown that the vantage point tree (vp-tree) can significantly outperform the kd-tree. In this paper we introduce the rkd-tree, a modified version of the kd-tree that applies ideas from the vp-tree to the kd-tree. This improved kd-tree version is shown to outperform both the kd-tree and the vp-tree in a number of artificial and real test-cases.
منابع مشابه
ارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملAn Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, <d, and the problem is to preprocess these points into a data structure, so that given a query point, the nearest data point to the query point can be reported efficiently. Because data sets can be quite large, we are interested in data structures that use optimal O(dn) storage. In this paper we consi...
متن کاملKinetic kd-Trees
We propose a simple variant of kd-trees, called rankbased kd-trees, for sets of points in R. We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search queries in O(n1−1/d + k) time, where k is the output size. The main advantage of rank-based kd-trees is that they can be efficiently kinetized: the KDS processes O(n) events in the worst case, assuming that the points fol...
متن کاملBkd-Tree: A Dynamic Scalable kd-Tree
In this paper we propose a new index structure, called the Bkd-tree, for indexing large multi-dimensional point data sets. The Bkdtree is an I/O-efficient dynamic data structure based on the kd-tree. We present the results of an extensive experimental study showing that unlike previous attempts on making external versions of the kd-tree dynamic, the Bkd-tree maintains its high space utilization...
متن کاملApproximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k-d tree. The standard k-d tree uses a tentative backtracking search to identify nearest neighbors. In contrast, the Approximate k-d tree (Ak-d tree) applies a depthfirst nontentative search to the k-d tree structure. T...
متن کامل